Core set analysis in inconsistent decision tables
نویسندگان
چکیده
Core set inconsistency always causes confusion regarding how to select the proper core set for data reduction in inconsistent decision tables. In this paper, partitions of knowledge granules are introduced to analyze this inconsistency, and it is concluded that there are only three types of effective partitions: those that focus on exact information, those that focus on exact, partial, and negative information and those that focus on exact, partial, negative, and probabilistic information. All useful core sets are calculated systematically by converting the three types of partitions to corresponding discernibility matrices. Then, we define three types of rules, positive, inexact, and confidence rules, based on the three types of partitions. Using these rules, an intelligible rule-based strategy is proposed to select the proper core set for a practical application, which resolves the confusion caused by core set inconsistency and completes the process of data reduction. Experimental analysis and industrial results demonstrate the effectiveness of the selection strategy. 2013 Elsevier Inc. All rights reserved.
منابع مشابه
A Learning Algorithm for Multiple Rule Trees
It is one of the key problems for web based decision support systems to generate knowledge from huge database containing inconsistent information. In this paper, a learning algorithm for multiple rule trees (MRT) is developed, which is based on ID3 algorithm and rough set theory. MRT algorithm can quickly generate decision rules from inconsistent decision information tables. Both space and time...
متن کاملRelative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
A relative reduct can be considered as a minimum set of attributes that preserves a certain classification property. This paper investigates three different classification properties, and suggests three distinct definitions accordingly. In the Pawlak rough set model, while the three definitions yield the same set of relative reducts in consistent decision tables, they may result in different se...
متن کاملApplication of Dynamic Programming Approach to Optimization of Association Rules Relative to Coverage and Length
In the paper, an application of dynamic programming approach to optimization of approximate association rules relative to the coverage and length is presented. It is based on the extension of dynamic programming approach for optimization of decision rules [1] to the case of inconsistent decision tables. Applications of rough sets theory to the construction of rules for knowledge representation ...
متن کاملAnalysis of alternative objective functions for attribute reduction in complete decision tables
Attribute reduction and reducts are important notions in rough set theory that can preserve discriminatory properties to the highest possible extent similar to the entire set of attributes. In this paper, the relationships among 13 types of alternative objective functions for attribute reduction are systematically analyzed in complete decision tables. For inconsistent and consistent decision ta...
متن کاملOn rule acquisition in incomplete multi-scale decision tables
Granular computing and acquisition of if-then rules are two basic issues in knowledge representation and data mining. A rough set approach to knowledge discovery in incomplete multi-scale decision tables from the perspective of granular computing is proposed in this paper. The concept of incomplete multi-scale information tables in the context of rough sets is first introduced. Information gran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 241 شماره
صفحات -
تاریخ انتشار 2013